Inverse languages
نویسنده
چکیده
Inverseness may be broadly characterized as a variety of structural organization in which a transitive, non-reflexive predication is specially marked in case a first or second person referent corresponds to a nonsubject logical role. This work seeks to bring greater clarity to the understanding of inverse languages by furnishing evidence for three points. First, an inverse system is to be distinguished from the inverse. language type. Individual systems differ in degree of adherence to this type, depending largely upon their conformity to head-marking (Nichols 1986). Secondly, there is no single formal behavior or set of formal behaviors found in every inverse language. For instance, not every inverse language evinces verbal direction markers or theme signs signaling the opposition of direct and inverse voices of the verb. The conformity of a language to the inverse type does not depend on its exhibiting this, or indeed, any other overt property. Rather, and thirdly, the inverse type appears to arise from a unique variety of structural organization whose primitives reside in ontological statuses (as opposed to grammatical or thematic relations). These ontological-level primitives are explained, and evidence for their grammatical reality is cited from over a half dozen genetically unrelated inverse languages.
منابع مشابه
Word Problem Languages for Free Inverse Monoids
This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of rank 1 is both 2-context-free (an intersection of two context-free languages) and ET0L; that the co-word problem of the free inverse monoid of rank 1 is context...
متن کاملHigher order indexed monadic systems
A word rewriting system is called monadic if each of its right hand sides is either a single letter or the empty word. We study the images of higher order indexed languages (defined by Maslov) under inverse derivations of infinite monadic systems. We show that the inverse derivations of deterministic level n indexed languages by confluent regular monadic systems are deterministic level n+1 lang...
متن کاملOn labeled birooted tree languages: Algebras, automata and logic
With an aim to developing expressive language theoretical tools applicable to inverse semigroup languages, that is, subsets of inverse semigroups, this paper explores the language theory of finite labeled birooted trees: Munn’s birooted trees extended with vertex labeling. To this purpose, we define a notion of finite state birooted tree automata that simply extends finite state word automata s...
متن کاملWalking automata in the free inverse monoid
In this paper, we study languages of birooted trees or, following Scheiblich-Munn’s theorem, subsets of free inverse monoids. Extending the classical notion of rational languages with a projection operator that maps every set of birooted trees to the subset of its idempotent elements it is first shown that the hierarchy induced by the nesting depth of that projection operator simply correspond ...
متن کاملUsing Inverse λ and Generalization to Translate English to Formal Languages
We present a system to translate natural language sentences to formulas in a formal or a knowledge representation language. Our system uses two inverse λ-calculus operators and using them can take as input the semantic representation of some words, phrases and sentences and from that derive the semantic representation of other words and phrases. Our inverse λ operator works on many formal langu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002